Realizability algebras III: some examples
نویسنده
چکیده
The notion of realizability algebra, which was introduced in [17, 18], is a tool to study the proof-program correspondence and to build new models of set theory, which we call realizability models of ZF. It is a variant of the well known notion of combinatory algebra, with a new instruction cc, and a new type for the environments. The sets of forcing conditions, in common use in set theory, are (very) particular cases of realizability algebras ; and the forcing models of ZF are very particular cases of realizability models.
منابع مشابه
Derivations of UP-algebras by means of UP-endomorphisms
The notion of $f$-derivations of UP-algebras is introduced, some useful examples are discussed, and related properties are investigated. Moreover, we show that the fixed set and the kernel of $f$-derivations are UP-subalgebras of UP-algebras,and also give examples to show that the two sets are not UP-ideals of UP-algebras in general.
متن کاملSheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction o...
متن کاملRealizability of Algebraic Galois Extensions by Strictly Commutative Ring Spectra
We discuss some of the basic ideas of Galois theory for commutative S-algebras originally formulated by John Rognes. We restrict attention to the case of finite Galois groups and to global Galois extensions. We describe parts of the general framework developed by Rognes. Central rôles are played by the notion of strong duality and a trace mapping constructed by Greenlees and May in the context ...
متن کاملSynthesizing Argumentation Frameworks from Examples
Argumentation is nowadays a core topic in AI research. Understanding computational and representational aspects of abstract argumentation frameworks (AFs) is a central topic in the study of argumentation. The study of realizability of AFs aims at understanding the expressive power of AFs under different semantics. We propose and study the AF synthesis problem as a natural extension of realizabi...
متن کاملPrimitive recursive selection functions for existential assertions over abstract algebras
We generalize to abstract many-sorted algebras the classical proof-theoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃yP (x, y) (where P is Σ01), provable in Peano arithmetic withΣ 1 induction, has a primitive recursive selection function. This involves a corresponding generalization to such algebras of the notion of primitive recursiveness . The main difficulty encountere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 28 شماره
صفحات -
تاریخ انتشار 2018